An Effective Genetic Algorithm for Multi-objective Integrated Process Planning and Scheduling with Various Flexibilities in Process Planning

نویسندگان

  • Xinyu Li
  • Xiaoyu Wen
  • Liang Gao
چکیده

Process planning and scheduling are two of the most important functions in modern manufacturing system. Considering their complementarity, integrating them more tightly can improve the performance and productivity of the whole manufacturing system. Meanwhile, the multi-objective optimization problem is widespread existing in manufacturing system. In this paper, an effective genetic algorithm is proposed to optimize the multi-objective integrated process planning and scheduling (IPPS) problem with various flexibilities in process planning. Three types of flexibilities related to process, sequence and machine are considered. And three objectives including makespan, total machine workload and maximal machine workload are taken into account simultaneously. According to the model and characteristics of multiobjective IPPS, the framework of the proposed algorithm is designed to optimize three objectives simultaneously. Effective genetic operations are employed in the proposed algorithm. Pareto set is set to store and maintain the solutions obtained during the searching procedure, the proposed algorithm could get several Pareto optimal solutions during one searching process. Two experiments are employed to test the performance of the proposed algorithm. The experiment results show that the proposed algorithm can solve multi-objective IPPS problem with various flexibilities in process planning effectively and obtain good solutions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Integrated Process Planning and Active Scheduling in a Supply Chain-A Learnable Architecture Approach

Through the lens of supply chain management, integrating process planning decisions and scheduling plans becomes an issue of great challenge and importance. Dealing with the problem paves the way to devising operation schedules with minimum makespan; considering the flexible process sequences, it can be viewed as a fundamental tool for achieving the scheme, too. To deal with this integration, t...

متن کامل

Exact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment

This paper presented a mixed integer programming for integrated scheduling and process planning. The presented process plan included some orders with precedence relations similar to Multiple Traveling Salesman Problem (MTSP), which was categorized as an NP-hard problem. These types of problems are also called advanced planning because of simultaneously determining the appropriate sequence and m...

متن کامل

Designing an integrated production/distribution and inventory planning model of fixed-life perishable products

This paper aims to investigate the integrated production/distribution and inventory planning for perishable products with fixed life time in the constant condition of storage throughout a two-echelon supply chain by integrating producers and distributors. This problem arises from real environment in which multi-plant with multi-function lines produce multi-perishable products with fixed life ti...

متن کامل

Meta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain

In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. UCS

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2014